منابع مشابه
A Decisive Best Effort Service Algorithm Designed to Rationalize Call Failures in Cellular Network
The paper proposes an admission control scheme based on adaptive bandwidth reservation to provide QOS guarantees for multimedia traffic carried in highspeed wireless cellular networks. The proposed scheme allocates bandwidth to a connection in the cell where the connection request originates and reserves bandwidth in all neighboring cells. It combines admission The proposed scheme adjusts the a...
متن کاملA Theory of Decisive Leadership
We present a theory that rationalizes voters’ preference for decisive leaders. Common definitions of decisiveness reference the speed of decision making. Although greater speed can be good or bad, agency problems between voters and politicians create a natural preference among voters for leaders who have a greater aversion to delay or more self-knowledge than the voters, and hence who make deci...
متن کاملAutophagy: a decisive process for stemness
Mature skeletal muscle is a stable tissue imposing low homeostatic demand on its stem cells, which remain in a quiescent state in their niche over time. We have shown that these long-lived resting stem cells attenuate proteotoxicity and avoid senescence through basal autophagy. This protective "clean-up" system is lost during aging, resulting in stem cell regenerative decline. Thus, autophagy i...
متن کاملAnalysing Decisive Stochastic Processes
In 2007, Abdulla et al. introduced the elegant concept of decisive Markov chain. Intuitively, decisiveness allows one to lift the good properties of finite Markov chains to infinite Markov chains. For instance, the approximate quantitative reachability problem can be solved for decisive Markov chains (enjoying reasonable effectiveness assumptions) including probabilistic lossy channel systems a...
متن کاملDecisive Markov Chains
We consider qualitative and quantitative verification problems for infinitestate Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almost certainly eventually reaches either F or a state from which F can no longer be reached. While all finite Markov chains are trivially decisive (for every set F ), this also holds for many classes of infinite Markov chai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2002
ISSN: 0028-0836,1476-4687
DOI: 10.1038/nj6899-03a